MAS: An On-line Non-binary CSP Solver

Nowadays, many dynamic problems can be efficiently modelled as Constraint Satisfaction Problems (CSPs). These constraints may be on-line non-binary constraints that traditional CSP solver can not manage directly. It is well known that any non-binary CSP can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may not be practical in problems with some particular properties, so it is necessary to manage these non-binary constraints directly. In this paper, we propose a model that manage on-line non-binary constraint satisfaction problems in a natural way as a dynamic and non-binary CSP solver. This nonbinary CSP solver carries out the search through a polyhedron that maintains in its vertices those solutions that satisfy all current non-binary constraints.